منابع مشابه
Crossed TRAILs
and colleagues have identified a protein called Hippi as one possible mediator of Huntington disease (HD) neuronal cell death. HD begins with expansion of the polyglutamine repeats in the huntingtin protein (Htt). This frees up Hip1 protein, which normally binds to Htt. Free Hip1 can then bind to the Hippi protein identified by Nicholson, and the two proteins join in a complex with procaspase 8...
متن کاملSpanning trails
A graph is called 2K2-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every 3 2 -tough 2K2-free graph with at least three vertices has a spanning trail with maximum degree at most 4. In this paper, we confirm this conjecture. We also provide examples for all t < 54 of t-tough graphs that do not have a spanning trail with maximum degre...
متن کاملOn paths, trails and closed trails in edge-colored graphs
In this paper we deal from an algorithmic perspective with different questions regarding properly edge-colored (or PEC) paths, trails and closed trails. Given a c-edge-colored graph G, we show how to polynomially determine, if any, a PEC closed trail subgraph whose number of visits at each vertex is specified before hand. As a consequence, we solve a number of interesting related problems. For ...
متن کاملTransforming eulerian trails
Fleischner, H., G. Sabidussi and E. Wenger, Transforming eulerian trails, Discrete Mathematics 109 (1992) 103-116. In this paper a set of transformations (K-transformations) between eulerian trails is investigated. It is known that two arbitrary eulerian trails can be transformed into each other by a sequence of K-transformations. For compatible eulerran trails the set of K-transformations is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cell Biology
سال: 2002
ISSN: 1540-8140,0021-9525
DOI: 10.1083/jcb1563rr5